Provably Near-Optimal LP-Based Policies for Revenue Management in Systems with Reusable Resources
نویسندگان
چکیده
Motivated by emerging applications in workforce management, we consider a class of revenue management problems in systems with reusable resources. The corresponding applications are modeled using the well-known loss network systems. We use an extremely simple linear program (LP) that provides an upper bound on the best achievable expected long-run revenue rate. The optimal solution of the LP is used to devise a conceptually simple control policy that we call the class selection policy (CSP). Moreover, the LP is used to analyze the performance of the CSP policy. We obtain the rst control policy with uniform performance guarantees. In particular, for the model with single resource and uniform resource requirements, the CSP policy is guaranteed to have expected long-run revenue rate that is at least half of the best achievable. More generally, as the ratio between the capacity of the system and the maximum resource requirement grows to in nity, the CSP policy is asymptotically optimal, regardless of any other parameter of the problem. The asymptotic performance analysis that we obtain is more general than existing results in several important dimensions. It is based on several novel ideas that we believe will be useful in other settings. ∗[email protected]. Sloan School of Management, MIT, Cambridge, MA, 02139. Part of this research was conducted while the author was a postdoctoral fellow at the IBM, T. J. Watson Research Center. †[email protected]. IBM T. J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598.
منابع مشابه
Electronic Companion — “ Provably Near - Optimal LP - Based Policies for Revenue Management in Systems with Reusable Resources ”
متن کامل
Provably Near-Optimal LP-Based Policies for Revenue Management in Systems with Reusable Resources (Preliminary Draft)
Motivated by emerging applications in workforce management, we consider a class of revenue management problems in systems with reusable resources. The corresponding applications are modeled using the well-known loss network systems (sometime also called the stochastic knapsack model). We use an extremely simple linear program (LP) that provides an upper bound on the best achievable expected lon...
متن کاملOptimal Energy Management and Feasibility Study of a Hybrid Energy System for a Remote Area
This paper investigates impacts of possible chances in energy policy and consumption behavior on optimal energy management and feasibility study of a hybrid energy system. The study was performed on a remote area near Esfarjan, a village located in Shahreza, Iran. In the main scenario, the current energy policy is applied while the consumption behavior of customers is studied by means of an inc...
متن کاملAssessing the Value of Dynamic Pricing in Network Revenue Management
Dynamic pricing for a network of resources over a finite selling horizon has received considerable attention in recent years, yet few papers provide effective computational approaches to solve the problem. We consider a resource decomposition approach to solve the problem and investigate the performance of the approach in a computational study. We compare the performance of the approach to stat...
متن کاملTwo-stage stochastic programming model for capacitated complete star p-hub network with different fare classes of customers
In this paper, a stochastic programming approach is applied to the airline network revenue management problem. The airline network with the arc capacitated single hub location problem based on complete–star p-hub network is considered. We try to maximize the profit of the transportation company by choosing the best hub locations and network topology, applying revenue management techniques to al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Operations Research
دوره 58 شماره
صفحات -
تاریخ انتشار 2010